Degree distribution and assortativity in line graphs of complex networks
نویسندگان
چکیده
Topological characteristics of links of complex networks influence the dynamical processes executed on networks triggered by links, such as cascading failures triggered by links in power grids and epidemic spread due to link infection. The line graph transforms links in the original graph into nodes. In this paper, we investigate how graph metrics in the original graph are mapped into those for its line graph. In particular, we study the degree distribution and the assortativity of a graph and its line graph. Specifically, we show, both analytically and numerically, the degree distribution of the line graph of an Erdős-Rényi graph follows the same distribution as its original graph. We derive a formula for the assortativity of line graphs and indicate that the assortativity of a line graph is not linearly related to its original graph. Additionally, line graphs of various graphs, e.g. Erdős-Rényi graphs, scale-free graphs, show positive assortativity. In contrast, we find certain types of trees and non-trees whose line graphs have negative assortativity.
منابع مشابه
Incorporating Assortativity and Degree Dependence into Scalable Network Models
Due to the recent availability of large complex networks, considerable analysis has focused on understanding and characterizing the properties of these networks. Scalable generative graph models focus on modeling distributions of graphs that match real world network properties and scale to large datasets. Much work has focused on modeling networks with a power law degree distribution, clusterin...
متن کاملTwo-walks degree assortativity in graphs and networks
Degree assortativity is the tendency for nodes of high degree (resp. low degree) in a graph to be connected to high degree nodes (resp. to low degree ones). It is usually quantified by the Pearson correlation coefficient of the degree–degree correlation. Here we extend this concept to account for the effect of second neighbours to a given node in a graph. That is, we consider the two-walks degr...
متن کاملOn the Distribution of the Maximal Clique Size for the Vertices in Real-world Network Graphs and Correlation Studies
The high-level contributions of this paper are as follows: We modify an existing branch-andbound based exact algorithm (for maximum clique size of an entire graph) to determine the maximal clique size that the individual vertices in the graph are part of. We then run this algorithm on six real-world network graphs (ranging from random networks to scale-free networks) and analyze the distributio...
متن کاملRandom line graphs and a linear law for assortativity.
For a fixed number N of nodes, the number of links L in the line graph H(N,L) can only appear in consecutive intervals, called a band of L. We prove that some consecutive integers can never represent the number of links L in H(N,L), and they are called a bandgap of L. We give the exact expressions of bands and bandgaps of L. We propose a model which can randomly generate simple graphs which are...
متن کاملDegree-degree correlations in random graphs with heavy-tailed degrees
We investigate degree-degree correlations for scale-free graph sequences. The main conclusion of this paper is that the assortativity coefficient is not the appropriate way to describe degreedependences in scale-free random graphs. Indeed, we study the infinite volume limit of the assortativity coefficient, and show that this limit is always non-negative when the degrees have finite first but i...
متن کامل